Almost all subgroups of a Lie group are free

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the norm of the derived‎ subgroups of all subgroups of a finite group

In this paper‎, ‎we give a complete proof of Theorem 4.1(ii) and a new‎ ‎elementary proof of Theorem 4.1(i) in [Li and Shen‎, ‎On the‎ ‎intersection of the normalizers of the derived subgroups of all‎ ‎subgroups of a finite group‎, ‎ J‎. ‎Algebra, ‎323  (2010) 1349--1357]‎. ‎In addition‎, ‎we also give a generalization of Baer's Theorem‎.

متن کامل

On Dense Free Subgroups of Lie Groups

We give a method for constructing dense and free subgroups in real Lie groups. In particular we show that any dense subgroup of a connected semisimple real Lie group G contains a free group on two generators which is still dense in G, and that any finitely generated dense subgroup in a connected non-solvable Lie group H contains a dense free subgroup of rank ≤ 2 · dimH . As an application, we o...

متن کامل

Almost all triangle-free triple systems are tripartite

A triangle in a triple system is a collection of three edges isomorphic to {123, 124, 345}. A triple system is triangle-free if it contains no three edges forming a triangle. It is tripartite if it has a vertex partition into three parts such that every edge has exactly one point in each part. It is easy to see that every tripartite triple system is triangle-free. We prove that almost all trian...

متن کامل

on the norm of the derived‎ subgroups of all subgroups of a finite group

in this paper‎, ‎we give a complete proof of theorem 4.1(ii) and a new‎ ‎elementary proof of theorem 4.1(i) in [li and shen‎, ‎on the‎ ‎intersection of the normalizers of the derived subgroups of all‎ ‎subgroups of a finite group‎, ‎ j‎. ‎algebra, ‎323  (2010) 1349--1357]‎. ‎in addition‎, ‎we also give a generalization of baer's theorem‎.

متن کامل

Almost All Palindromes Are Composite

We study the distribution of palindromic numbers (with respect to a fixed base g ≥ 2) over certain congruence classes, and we derive a nontrivial upper bound for the number of prime palindromes n ≤ x as x → ∞. Our results show that almost all palindromes in a given base are composite. ∗MSC Numbers: 11A63, 11L07, 11N69 †Corresponding author 1

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 1971

ISSN: 0021-8693

DOI: 10.1016/0021-8693(71)90107-4